Monoidal functional dependencies

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monoidal functional dependencies

We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express stronger relationships between attribute values than the ordinary FDs. In our setting, the dependencies not only express that certain values are determined by othe...

متن کامل

Imprecise Functional Dependencies

IntroductIon Functional dependencies represent a fundamental concept in the design of a database since they are capable of capturing some semantics of the data strongly connected with the occurrence of redundancy in a database. The development of applications working on fuzzy and multimedia databases has required the extension of the functional dependency notion to these new types of data. Unfo...

متن کامل

Functional Dependencies between Variables

Itisa standard practice to de ne the truth conditionsfora rst-orderform ula with a quanti erin term sofassignm entsto individualvariables. For exam ple,letM be a m odeland s a function (assignm ent)which assignsto variableselem entsin thedom ain ofM .Then a formula 9x (x)istruein M undersi thereisan assignm entswhich di ersfrom satm ostin thevalue itassignsto x,such that (x)istrue on M unders. ...

متن کامل

Functional Dependencies for XML

In this paper we address the problem of how to extend the deenition of functional dependencies (FDs) in incomplete relations to XML documents. An incomplete relation is said to strongly satisfy a FD if every completion of the relation, obtained by replacing all null values by data values, satisses the FD in the ordinary sense. We propose a syntactic deenition of strong FD satisfaction in a XML ...

متن کامل

Functional Dependencies in Horn

This paper studies functional dependencies in Horn theories, both when the theory is represented by its clausal form and when it is de ned as the Horn envelope of a set of models. We provide polynomial algorithms for the recognition of whether a given functional dependency holds in a given Horn theory, as well as polynomial algorithms for the generation of some representative sets of functional...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2015

ISSN: 0022-0000

DOI: 10.1016/j.jcss.2015.03.006